#include<bits/stdc++.h>
using namespace std;
int main()
{
int tc;
cin >> tc;
int n,even,odd;
bool ans;
while(tc--){
cin >> n;
int a[n];
for(int i=0; i<n; i++){
cin >> a[i];
}
even=odd=0;
ans = true;
for(int i=0; i<n; i+=2){
if(a[i]%2==0) even++;
else odd++;
if(even>0 and odd>0) ans = false;
}
even=odd=0;
for(int i=1; i<n; i+=2){
if(a[i]%2==0) even++;
else odd++;
if(even>0 and odd>0) ans = false;
}
if(ans) cout << "YES\n";
else cout << "NO\n";
}
}
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |